Connectivity of Confined Dense Networks: Boundary Effects and Scaling Laws
نویسندگان
چکیده
In this paper, we study the probability that a dense network confined within a given geometry is fully connected. We employ a cluster expansion approach often used in statistical physics to analyze the effects that the boundaries of the geometry have on connectivity. To maximize practicality and applicability, we adopt four important point-to-point link models based on outage probability in our analysis: single-input single-output (SISO), single-input multiple-output (SIMO), multiple-input singleoutput (MISO), and multiple-input multiple-output (MIMO). Furthermore, we derive diversity and power scaling laws that dictate how boundary effects can be mitigated (to leading order) in confined dense networks for each of these models. Finally, in order to demonstrate the versatility of our theory, we analyze boundary effects for dense networks comprising MIMO point-to-point links confined within a right prism, a polyhedron that accurately models many geometries that can be found in practice. We provide numerical results for this example, which verify our analytical results.
منابع مشابه
Poster Abstract: On the Scaling Laws of Dense Wireless Sensor Networks
We characterize the scaling laws of many-to-one dense wireless sensor networks and derive conditions governing the observability of random fields by such networks. We further extend our results to the multimodal case where the sensors observe multiple random processes simultaneously. Quite interestingly, our results show that an unbounded number of spatially bandlimited Gaussian processes can b...
متن کاملAverage Consensus in Dense Wireless Networks with Long-Range Connectivity
We consider the effect of interference on the convergence rate of a class of distributed averaging algorithms called consensus algorithms, which iteratively compute the measurement average by message passing among nodes. It is usually assumed that these algorithms converge faster with a greater exchange of information (i.e., by increased network connectivity) in every iteration. However, when t...
متن کاملHierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power loss of r as well as a random phase. We identify the scaling laws of the information theoretic capacity of the network. In the case of dense networks, where the area is fixed and the density of nodes increasing, w...
متن کاملENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS
Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have be...
متن کاملOn the Order Optimality of Large-scale Underwater Networks—Part II: Dense Network Model
This is the second in a two-part series of papers on informationtheoretic capacity scaling laws for an underwater acoustic network with n regularly located nodes on a square, in which both bandwidth and received signal power can be limited significantly. Part I showed that in extended networks of unit node density, using the nearest-neighbor multi-hop (MH) protocol is order-optimal for all oper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1201.4013 شماره
صفحات -
تاریخ انتشار 2011